Privacy system

ABSTRACT

The disclosure relates generally to mobile device applications, and more particularly, to a privacy system for a mobile device application. In one embodiment, a computer-implemented method of sending and receiving encrypted messages between users within an associated group of users is provided. The method includes: receiving a first message from a first user within the group of users, wherein the first message includes proprietary information; encrypting the first message into ciphertext; transforming the ciphertext into a second message, wherein the second message includes quotidian information; and sending the second message to a second user within the group of users. Once the second user receives the second message, the second user will assay the second message to be an encryption of an unknown first message. The second message is received from the second user, and is decrypted into the first message, which is displayed to the second user.

REFERENCE TO RELATED APPLICATIONS

The current application is a continuation of application Ser. No.13/995,815, filed Jun. 19, 2013, which claims the benefit of PCTApplication PCT/US2012/07031 filed on Dec. 18, 2012, which claimed thebenefit of U.S. Provisional Application No. 61/577,323, which was filedon Dec. 19, 2011, and all of which are titled “PRIVACY SYSTEM” andhereby incorporated by reference.

TECHNICAL FIELD

The disclosure relates generally to mobile device applications, and moreparticularly, to a privacy system for a mobile device application.

BACKGROUND ART

Currently, mobile communication systems provide for the transmission ofshort data messages between mobile devices via a message protocol. Forexample, many mobile communication systems allow for mobile devices tosend and receive short data messages via a short message service (SMS).

As the use of mobile devices becomes increasing popular in a businessenvironment, it is becoming increasingly desirable to users of suchcommunications systems and mobile devices to be able to send and receivemessages without revealing any private or proprietary information thatmay be sensitive to the business, and detrimental to the business, ifrevealed. Further, users may find it useful to hide personal messagesthat are sent from, or received on, a mobile device.

SUMMARY OF THE INVENTION

Aspects of the invention provide a method of sending and receivingencrypted messages between users within an associated group of users. Inone embodiment, a method includes: receiving a first message from afirst user within the group of users, wherein the first message includesproprietary information; encrypting the first message into ciphertext;transforming the ciphertext into a second message, wherein the secondmessage includes quotidian information; and sending the second messageto a second user within the group of users. Once the second userreceives the second message, the second user will assay the secondmessage to be an encryption of an unknown first message. The secondmessage is received from the second user, and is decrypted into thefirst message, which is displayed to the second user.

A first aspect of the invention provides a computer-implemented methodof exchanging private messages between users within an associated groupof users, the method comprising: receiving a first message from a firstuser within the group of users, wherein the first message includesprivate information; encrypting the first message into ciphertext;transforming the ciphertext into a second message, wherein the secondmessage includes a quotidian message comprising mundane contentunrelated in meaning and relevance to the first message; and outputtingthe second message to a second user within the group of users.

A second aspect of the invention provides a computer program comprisingprogram code embodied in at least one computer-readable medium, whichwhen executed, enables a computer system to implement a method ofexchanging private messages between users within an associated group ofusers, the method comprising: receiving a first message from a firstuser within the group of users, wherein the first message includesprivate information; encrypting the first message into ciphertext;transforming the ciphertext into a second message, wherein the secondmessage includes a quotidian message comprising mundane contentunrelated in meaning and relevance to the first message; and outputtingthe second message for a second user within the group of users.

A third aspect of the invention provides a computer system having aprocessor and memory for exchanging private messages between userswithin an associated group of users wherein the computer system isoperable to: receive a first message from a first user within the groupof users, wherein the first message includes private information;encrypt the first message into ciphertext; transform the ciphertext intoa second message, wherein the second message includes a quotidianmessage that lacks a relevant relationship with the first message; storethe second message and the ciphertext as a linked pair; and output thesecond message for a second user within the group of users.

Other aspects of the invention provide methods, systems, programproducts, and methods of using and generating each, which include and/orimplement some or all of the actions described herein. The illustrativeaspects of the invention are designed to solve one or more of theproblems herein described and/or one or more other problems notdiscussed.

BRIEF DESCRIPTION OF THE DRAWINGS

These and other features of the disclosure will be more readilyunderstood from the following detailed description of the variousaspects of the invention taken in conjunction with the accompanyingdrawings that depict various aspects of the invention.

FIG. 1 shows an illustrative environment for sending and receivingencrypted messages between users according to embodiments of theinvention.

FIG. 2 shows a block diagram of an exemplary encryption/decryptionprogram according to embodiments of the invention.

It is noted that the drawings may not be to scale. The drawings areintended to depict only typical aspects of the invention, and thereforeshould not be considered as limiting the scope of the invention. In thedrawings, like numbering represents like elements between the drawings.

DETAILED DESCRIPTION OF THE INVENTION

As indicated above, aspects of the invention provide a method of sendingand receiving encrypted messages between users within an associatedgroup of users. As used herein, unless otherwise noted, the term “set”means one or more (i.e., at least one) and the phrase “any solution”means any now known or later developed solution.

As mentioned previously, mobile communication systems currently providefor the transmission of short data messages between mobile devices via amessage protocol. For example, many mobile communication systems allowfor mobile devices to send and receive short data messages via a shortmessage service (SMS).

As the use of mobile devices becomes increasing popular in a businessenvironment, it is becoming increasingly desirable to users of suchcommunications systems and mobile devices to be able to send and receivemessages without revealing any private or proprietary information thatmay be sensitive to the business, and detrimental to the business, ifrevealed. Further, users may find it useful to hide personal messagesthat are sent from, or received on, a mobile device.

Aspects of the invention provide a method of sending and receivingencrypted messages between users within an associated group of users. Inone embodiment, a method includes: receiving a first message from afirst user within the group of users, wherein the first message includesproprietary information; encrypting the first message into ciphertext;transforming the ciphertext into a second message, wherein the secondmessage includes quotidian information; and sending the second messageto a second user within the group of users.

Turning to the drawings, FIG. 1 shows an illustrative environment 10 forsending and receiving encrypted messages according to embodiments of theinvention. To this extent, environment 10 includes a computer system 20that can perform a process described herein in order to send and receiveencrypted messages. In particular, computer system 20 is shown includingan encryption/decryption program 30, which makes computer system 20operable to send and receive encrypted messages by performing a processdescribed herein.

Computer system 20 is shown including a processing component 22 (e.g.,one or more processors), a storage component 24 (e.g., a storagehierarchy), an input/output (I/O) component 26 (e.g., one or more I/Ointerfaces and/or devices), and a communications pathway 28. In general,processing component 22 executes program code, such asencryption/decryption program 30, which is at least partially fixed instorage component 24. While executing program code, processing component22 can process data, which can result in reading and/or writingtransformed data from/to storage component 24 and/or I/O component 26for further processing. Pathway 28 provides a communications linkbetween each of the components in computer system 20. I/O component 26can comprise one or more human I/O devices, which enable a plurality ofusers 1A, 1B to interact with computer system 20 and/or one or morecommunications devices to enable a system user 1A, 1B to communicatewith computer system 20 using any type of communications link. To thisextent, encryption/decryption program 30 can manage a set of interfaces(e.g., graphical user interface(s), application program interface,and/or the like) that enable human and/or system users 1A, 1B tointeract with encryption/decryption program 30. Further,encryption/decryption program 30 can manage (e.g., store, retrieve,create, manipulate, organize, present, etc.) the data, such as data indatabase 40, using any solution.

In any event, computer system 20 can comprise one or more generalpurpose computing articles of manufacture (e.g., computing devices)capable of executing program code, such as encryption/decryption program30, installed thereon. As used herein, it is understood that “programcode” means any collection of instructions, in any language, code ornotation, that cause a computing device having an information processingcapability to perform a particular action either directly or after anycombination of the following: (a) conversion to another language, codeor notation; (b) reproduction in a different material form; and/or (c)decompression. To this extent, encryption/decryption program 30 can beembodied as any combination of system software and/or applicationsoftware.

Further, encryption/decryption program 30 can be implemented using a setof modules 32. In this case, a module 32 can enable computer system 20to perform a set of tasks used by encryption/decryption program 30, andcan be separately developed and/or implemented apart from other portionsof encryption/decryption program 30. As used herein, the term“component” means any configuration of hardware, with or withoutsoftware, which implements the functionality described in conjunctiontherewith using any solution, while the term “module” means program codethat enables a computer system 20 to implement the actions described inconjunction therewith using any solution. When fixed in a storagecomponent 24 of a computer system 20 that includes a processingcomponent 22, a module is a substantial portion of a component thatimplements the actions. Regardless, it is understood that two or morecomponents, modules, and/or systems may share some/all of theirrespective hardware and/or software. Further, it is understood that someof the functionality discussed herein may not be implemented oradditional functionality may be included as part of computer system 20.

When computer system 20 comprises multiple computing devices, eachcomputing device can have only a portion of encryption/decryptionprogram 30 fixed thereon (e.g., one or more modules 32). However, it isunderstood that computer system 20 and encryption/decryption program 30are only representative of various possible equivalent computer systemsthat may perform a process described herein. To this extent, in otherembodiments, the functionality provided by computer system 20 andencryption/decryption program 30 can be at least partially implementedby one or more computing devices that include any combination of generaland/or specific purpose hardware with or without program code. In eachembodiment, the hardware and program code, if included, can be createdusing standard engineering and programming techniques, respectively.

Regardless, when computer system 20 includes multiple computing devices,the computing devices can communicate over any type of communicationslink. Further, while performing a process described herein, computersystem 20 can communicate with one or more other computer systems usingany type of communications link. In either case, the communications linkcan comprise any combination of various types of optical fiber, wired,and/or wireless links; comprise any combination of one or more types ofnetworks; and/or utilize any combination of various types oftransmission techniques and protocols.

As discussed herein, encryption/decryption program 30 enables computersystem 20 to send and receive encrypted messages between users in anassociated group of users.

It is understood that although only two users 1A, 1B are shown in FIG.1, there may be any number of users in environment 10. As will bedescribed herein, users 1A, 1B are associated together as a group ofusers. Further, although a message 4 (FIG. 2) is shown as being sentfrom user 1A to user 1B, it is understood that this is for exemplarypurposes only and that message 4 may be sent from any user within anassociated group of users.

To form an associated group of users (e.g., users 1A, 1B), a user, forexample user 1A may create an account, via client device 2A, withencryption/decryption program 30. Client devices 2A, 2B may include anynetworked device, such as, but not limited to a mobile device(smartphone), tablet, computing device, etc. An account may be generatedby supplying information associated with user 1A, such as an e-mailaddress, a mobile phone number, an address, and billing information.Once an account is created, user 1A may create a group of associatedusers (e.g., user 1B). A passphrase, an known in the art, is associatedwith this group of associated users. User 1A may create a uniquepassphrase, or encryption/decryption program 30 may randomly generate apassphrase. Additionally, user 1A may select to prepend or append akeyphrase to a quotidian message 8 (after encryption of message 4) toaid in user 1B being able to readily assay that a quotidian message 8(FIG. 2) is an encryption of an unknown message (message 4). Forexample, user 1A may choose to prepend “HEY!” to the beginning of everyquotidian message 8.

When forming the associated group of users, user 1A may select themethod of transformation for encrypting messages (e.g., message 4 ofFIG. 2), which includes proprietary information, into a quotidian (i.e.,mundane, ordinary) message 8. As will be described later herein, user 1Amay select a canonic transformation of a message 4 or a non-canonictransformation of a message 4. If a canonic transformation of message 4is selected, the quotidian message 8 is based on several factors, suchas a sentence type, a clause count, and/or a sentence mode. If anon-canonic transformation of message 4 is selected, the quotidianmessage 8 is based on a user-defined database of phrases (such as themesand/or phrases used in social networking sources).

Turning now to FIG. 2, once user 1A creates an associated group of users(e.g., user 1B), user 1A may decide to send users within the associatedgroup of users (user 1B) a message, i.e., message 4, that includesproprietary or secret information. User 1A sends message 4 (via clientdevice 1A, FIG. 1) to encryption/decryption program 30. That is, user 1Amay send message 4 via a mobile application on a mobile device, or via awebsite hosted on computing device, or any other method. Encryptionprogram 50 receives this message 4, and encrypts message 4 intociphertext message 6. For example, encryption program 50 may employ aRijndael algorithm, as known in the art. However, any other now known orlater developed algorithm for encrypting message 4 into a ciphertextmessage 6 may be used. In order to encrypt message 4 into ciphertextmessage 6, the passphrase associated with the group of users 1A, 1B isused in the algorithm. The message 4 that is sent from user 1A is notstored, however, the ciphertext message 6 is stored in database 40. Inparticular, the ciphertext message may be stored or associated with thegenerated quotidian message 8 in the database, e.g., as a “linked pair”.Other information may likewise be stored with the linked pair, e.g.,user information, etc.

Transformation program 52 receives the ciphertext message 6 andtransforms the ciphertext message 6 into a quotidian message 8. That is,quotidian message 8 is a mundane, normal, non-proprietary message. Thereis no 1:1 or symmetric relationship between the encrypted ciphertextmessage 6 and the quotidian message 8. That is, there is no way torecover the encrypted ciphertext message 6 directly from the quotidianmessage 8. Further, the content of the quotidian message 8 is utterlydifferent from the original proprietary message 4, e.g., containingnothing more than casual “chit-chat.”The resulting quotidian message 8appears as an innocuous, even trivial communication that is unrelated inmeaning and relevance to the original proprietary message. Rather, forexample, the quotidian message 8 may contain the semantic coherency ofthe sort of ubiquitous casual conversations found on mobile devices. Somuch so, the quotidian message 8 can be publically posted to such socialnetworking sites such as Facebook and Twitter. For example, an originalproprietary message may state:

-   -   “Bob—I have this great idea for an invention—let's meet at the        usual coffee house tomorrow at 3 PM ok?”        The resulting quotidian message may then appear as:    -   “Hi—I haven't heard from you in a while. My new car is        great—hope things are well at home—Alice”        As is evident, the original message 4 and quotidian message 8        are unrelated in meaning and relevance. Once generated, the        quotidian message 8 is stored or associated with the ciphertext        message 6 in database 40, and is then sent to the users within        the associated group of users (e.g., user 1B). Members in the        associated group who receive the message 8 will be able to        discern whether a message is not a normal message, e.g., based        on knowledge that the sender is a member of the group, the lack        of context of the message, pre-agreed terms or phrases, etc.

In transforming ciphertext message 6 into quotidian message 8,transformation program 52 may employ a canonic transformation that usescanonic factors of message 4 for the transformation. For example, asentence type, a clause count, and/or a sentence mode of message 4 maybe used. The following describes an algorithm in transforming ciphertextmessage 6 into quotidian message 8.

Ciphertext message 6 is first converted and stored as an amplifiedBase-64 radix array of ASCII text. The array may be denoted as {b[ . . .i . . . ]} where i assumes the index values of the array from 0 . . .length(b). The amplified Base-64 character set includes 52 alphabeticcharacters, 10 numeric characters, with additional ‘+’ ‘=’ and ‘/’),with ‘−’ added as a meta-character. The sequence is A’, ‘B’, ‘C’, . . .‘a’, ‘b’, ‘c’, . . . ‘0’, ‘1’, ‘2’, . . . ‘+’ ‘−’ ‘=’, ‘/’. It merelyadds two extra characters to the normal Base-64 array.

Transformation program 52 assumes A[x] be an associative array mappingbyte values (represented in amplified Base-64) to positional arrayindices (integers):

-   -   A[{‘A’→0, ‘B’→1, ‘C’→2 . . . }]        -   Thus,    -   A[0]→‘A’ and A[‘A’]→0.        The values of {b[i]} may be mapped to an integer for any        position i:    -   A[b[i]]=j where jε{0 . . . 65}        Next, a function F(i)→j is defined, which gets a byte value of        b[ ] at position i and returns a positional value j. With this        function, the return values for these specific values. In Table        1 below, the return values for specific values provide the        canonic factors.

TABLE 1 Index Operation 0 0 < F(0) < 20 Declarative, 21 < F(0) < 41Interrogative 42 < F(0) < 65: Exclamatory 1 0 < F(1) < 20: Uni-Clausal21 < F{1) < 41: Bi-Clausal 42 < F(1) < 65: Tri-Clausal m = len(b) − 5 0< F(m) < 20: Negative Modal 21 < F{m) < 41: Zero Modal 42 < F(m) < 65:Positive Modal

Given these rules, transformation program 52 defines the following: i)The “canonic character” K of ciphertext 6 (for example, represented asarray b[ ]) is the set of construction rules defined by the index triple{0,1,m}. Thus K(b[0,1,m]) determines the nature of an English languagesentence according to the rules determined by the outcomes of the tableabove. The return of K(b[0,1,m]) is a Canonic Triple. ii) The functionS(K(b[0,1,m]))→U takes a Canonic Triple and creates the quotidianmessage 8—i.e. a sentence in English constrained to 160 characters. Thefunction S( ) is called the Transform Function. This function requiresthe following database component: iii) The function RDB(i,C_DB)retrieves UTM strings from a database of clauses. Namely, index i is theith clause of a specific table within database 40. The table variantsthe specific table are customizable as to their “Mode” (i.e. “Negative,”“Zero,” “Positive”), and their sentence type (Declarative,Interrogative, and Exclamatory).

For example, for a message 4 that states “See me today—it's important!”,a ciphertext 6 may be: “P/t3qjf4wkhVPUSOhZz35Eoe5AWynITRVHVaGszxtwc=”.However, it is understood that the specific ciphertext 6 depends on thepassphrase generated for the associated group of users or created byuser 1A. The Cipher Text array is b[ . . . i . . . ] with values:

-   -   b[0]=‘P’ F(b(0))=15 (Sentence is Declarative)    -   b[1]=‘/’ F(b(1))=63 (Sentence is Tri-Clausal)    -   b[m]=‘x’ F(b(m))=49 (Sentence is Positive Modal)    -   . . .    -   b[43]=‘=’ (the padding character in Base64) F(b(43))=65        Thus, the quotidian message 8 will be in three clauses        (Tri-Clausal), Declarative and denoting a positive sense. The        canonic character is defined as:        ‘TDP’. Thus, in this example, K returns a Canonic Triple:        K(b[0,1,m])=‘TDP’.

In converting ciphertext 6 to quotidian message 8, a triplet, such as“TDP” may yield: “I haven't heard from you. Things are okay with methese days. Hope to hear from you”. In the quotidian message 8, thereare three clauses, the sentences are declarative, and the sentence ispositive in inflection or mode.

A user 1A may select a non-canonic transformation of message 4 intoquotidian message 8. In this case, transformation of message 4 would bebased on a user-defined database of phrases. That is, a user 1A mayselect a theme, such as, but not limited to, news, sports, economicmarkets, geographic and/or meteorological subjects, entertainment andmedia, and/or technology and science. Database 40 would include aplurality of tables that include phrases within these themes or topics.Alternatively, user 1A may select a database of automated messages froma social networking source that user 1A listed in creating theassociated group of users. In another embodiment, quotidian message 8may include a hyperlink that points user 1B to a website that stores theciphertext 6 associated with quotidian message 8.

In receiving quotidian message 8, user 1B may receive quotidian message8 in the form of a SMS message, which would be limited to 160characters. Alternatively, user 1A may post quotidian message 8 to asocial networking website, where user 1B (and any other user associatedwith the group of users) are able to view postings. Alternatively, user1A may post quotidian message 8 to a Twitter® account, which is limitedto 140 characters.

After user 1B receives quotidian message 8, user 1B may send thequotidian message 8 to decryption program 54. That is, user 1B may loginto a mobile application on a mobile device (i.e., client device 2B) ora website. It is noted that user 1B will know, by assaying the quotidianmessage 8, that quotidian message 8 is not a “true” message. That is,based on prior knowledge of user 1A creating an associated group ofusers for sharing proprietary information, and knowledge of user 1A ingeneral, user 1B will be able to ascertain that quotidian message 8 mustbe decrypted.

Decryption program 54 is able to receive and process the quotidianmessage 8 to obtain message 4. In particular, the receiving user (user1B) can resubmit the quotidian message 8 back to the decryption program54 (e.g., using a client program on a smartphone) which will then searchthe database 40 and retrieve the associated encrypted ciphertext message6. The encrypted ciphertext message 6 will then be decrypted bydecryption program 54 to generate the original message 4. However, it isunderstood that message 4 is only displayed for user 1B (via clientdevice 2B) and is not sent to user 1B. Once the message 4 is viewed, themessage 4 is deleted. In this way, proprietary messages may be sent fromuser 1A to user 1B, both privately and efficiently. Alternatively,encryption/decryption program 30 may be set to automatically delete themessage 4 after user 1B has read message 4, or encryption/decryptionprogram 30 may be set to allow user 1B to manually delete message 4after he/she has read the message 4. Further, in initializing an accountand/or an associated group of users, user 1A may be allowed to specifythat encryption/decryption program 30 will automatically delete message4 after user 1B has read message 4.

While shown and described herein as a method and system for sending andreceiving encrypted messages, it is understood that aspects of theinvention further provide various alternative embodiments. For example,in one embodiment, the invention provides a computer program fixed in atleast one computer-readable medium, which when executed, enables acomputer system to send and receive encrypted messages. To this extent,the computer-readable medium includes program code, such asencryption/decryption program 30 (FIG. 1), which implements some or allof a process described herein. It is understood that the term“computer-readable medium” comprises one or more of any type of tangiblemedium of expression, now known or later developed, from which a copy ofthe program code can be perceived, reproduced, or otherwise communicatedby a computing device. For example, the computer-readable medium cancomprise: one or more portable storage articles of manufacture; one ormore memory/storage components of a computing device; paper; and/or thelike.

In another embodiment, the invention provides a method of providing acopy of program code, such as encryption/decryption program 30 (FIG. 1),which implements some or all of a process described herein. In thiscase, a computer system can process a copy of program code thatimplements some or all of a process described herein to generate andtransmit, for reception at a second, distinct location, a set of datasignals that has one or more of its characteristics set and/or changedin such a manner as to encode a copy of the program code in the set ofdata signals. Similarly, an embodiment of the invention provides amethod of acquiring a copy of program code that implements some or allof a process described herein, which includes a computer systemreceiving the set of data signals described herein, and translating theset of data signals into a copy of the computer program fixed in atleast one computer-readable medium. In either case, the set of datasignals can be transmitted/received using any type of communicationslink.

In still another embodiment, the invention provides a method ofgenerating a system for sending and receiving encrypted messages. Inthis case, a computer system, such as computer system 20 (FIG. 1), canbe obtained (e.g., created, maintained, made available, etc.) and one ormore components for performing a process described herein can beobtained (e.g., created, purchased, used, modified, etc.) and deployedto the computer system. To this extent, the deployment can comprise oneor more of: (1) installing program code on a computing device; (2)adding one or more computing and/or I/O devices to the computer system;(3) incorporating and/or modifying the computer system to enable it toperform a process described herein; and/or the like.

It is understood that aspects of the invention can be implemented aspart of a business method that performs a process described herein on asubscription, advertising, and/or fee basis. That is, a service providercould offer to send and receive encrypted messages as described herein.In this case, the service provider can manage (e.g., create, maintain,support, etc.) a computer system, such as computer system 20 (FIG. 1),that performs a process described herein for one or more customers. Inreturn, the service provider can receive payment from the customer(s)under a subscription and/or fee agreement, receive payment from the saleof advertising to one or more third parties, and/or the like.

The foregoing description of various aspects of the invention has beenpresented for purposes of illustration and description. It is notintended to be exhaustive or to limit the invention to the precise formdisclosed, and obviously, many modifications and variations arepossible. Such modifications and variations that may be apparent to anindividual in the art are included within the scope of the invention asdefined by the accompanying claims.

What is claimed is:
 1. A computer-implemented method of exchanging private messages between users within an associated group of users, the method comprising: receiving on a primary computer system a first message from a first client computing system associated with a first user within the group of users, wherein the first message includes private information; encrypting the first message into ciphertext; transforming the ciphertext into a second message, wherein the second message includes a quotidian message comprising mundane content unrelated in meaning and relevance to the first message; and outputting the second message to a second client computing system associated with a second user within the group of users while maintaining the ciphertext exclusively in a storage component of the primary computer system.
 2. The computer-implemented method of claim 1, wherein transforming the ciphertext into the second message includes assessing a plurality of canonic factors of the ciphertext.
 3. The computer-implemented method of claim 1, wherein transforming the ciphertext into the second message includes utilizing a user-defined database of phrases for the second message.
 4. The computer-implemented method of claim 3, wherein the user-defined database includes one of: a theme category database or a database including automated messages from a social network source.
 5. The computer-implemented method of claim 1, wherein the second message includes a hyperlink.
 6. The computer-implemented method of claim 1, further comprising: in response to the second user assaying the second message to be a quotidian message, receiving the second message; retrieving the ciphertext associated with the second message; decrypting the ciphertext into the first message; and displaying the first message to the second user.
 7. A computer program comprising program code embodied in at least one non-transitory computer-readable storage medium, which when executed, enables a computer system to implement a method of exchanging private messages between users within an associated group of users, the method comprising: receiving a first message from a first client computing system associated with a first user within the group of users, wherein the first message includes private information; encrypting the first message into ciphertext; transforming the ciphertext into a second message, wherein the second message includes a quotidian message comprising mundane content unrelated in meaning and relevance to the first message; and outputting the second message to a second client computing system associated with a second user within the group of users, while maintaining the ciphertext exclusively in a storage component of the computer system.
 8. The computer program of claim 7, wherein transforming the ciphertext into the second message includes assessing a plurality of canonic factors of the ciphertext.
 9. The computer program of claim 7, wherein transforming the ciphertext into the second message includes utilizing a user-defined database of phrases for the second message.
 10. The computer program of claim 9, wherein the user-defined database includes one of: a theme category database or a database including automated messages from a social network source.
 11. The computer program of claim 8, wherein the second message includes a hyperlink.
 12. The computer program of claim 7, further comprising: in response to the second user assaying the second message to be a quotidian message, receiving the second message; retrieving the ciphertext associated with the second message; decrypting the ciphertext into the first message; and displaying the first message to the second user.
 13. A computer system having a processor and memory for exchanging private messages between users within an associated group of users wherein the computer system is operable to: receive a first message from a first client computing system associated with a first user within the group of users, wherein the first message includes private information; encrypt the first message into ciphertext; transform the ciphertext into a second message, wherein the second message includes a quotidian message that lacks a relevant relationship with the first message; store the second message and the ciphertext as a linked pair in a storage component of the computer system; and output the second message to a second client computing system associated with a second user within the group of users, while maintaining the ciphertext exclusively in the storage component of the computer system.
 14. The computer system of claim 13, wherein transforming the ciphertext into the second message includes assessing a plurality of canonic factors of the ciphertext.
 15. The computer system of claim 13, wherein transforming the ciphertext into the second message includes utilizing a user-defined database of phrases for the second message.
 16. The computer system of claim 15, wherein the user-defined database includes one of: a theme category database or a database including automated messages from a social network source.
 17. The computer system method of claim 13, wherein the second message includes a hyperlink.
 18. The computer system of claim 13, wherein the computer system is further operable to: receive the second message from the second user; retrieve the ciphertext linked with the second message; decrypt the ciphertext into the first message; and display the first message to the second user. 